Measuring similarity in feature space of knowledge entailed by two separate rule sets
نویسندگان
چکیده
This paper addresses the task of comparing two rule sets induced within the same feature space for measuring the knowledge entailed jointly by the two. A procedure that quantifies the similarity of knowledge entailed by two separate rule sets in a given feature space is proposed. A formalized description of the proposed procedure along with its computational complexity analysis, applicability and utility is presented. Application of the proposed procedure is demonstrated using two rule sets from the computer security domain. q 2005 Elsevier B.V. All rights reserved.
منابع مشابه
CLaC-CORE: Exhaustive Feature Combination for Measuring Textual Similarity
CLaC-CORE, an exhaustive feature combination system ranked 4th among 34 teams in the Semantic Textual Similarity shared task STS 2013. Using a core set of 11 lexical features of the most basic kind, it uses a support vector regressor which uses a combination of these lexical features to train a model for predicting similarity between sentences in a two phase method, which in turn uses all combi...
متن کاملINTERVAL-VALUED INTUITIONISTIC FUZZY SETS AND SIMILARITY MEASURE
In this paper, the problem of measuring the degree of inclusion and similarity measure for two interval-valued intuitionistic fuzzy sets is considered. We propose inclusion and similarity measure by using order on interval-valued intuitionistic fuzzy sets connected with lexicographical order. Moreover, some properties of inclusion and similarity measure and some correlation, between them an...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کاملIFSB-ReliefF: A New Instance and Feature Selection Algorithm Based on ReliefF
Increasing the use of Internet and some phenomena such as sensor networks has led to an unnecessary increasing the volume of information. Though it has many benefits, it causes problems such as storage space requirements and better processors, as well as data refinement to remove unnecessary data. Data reduction methods provide ways to select useful data from a large amount of duplicate, incomp...
متن کاملHESITANT FUZZY INFORMATION MEASURES DERIVED FROM T-NORMS AND S-NORMS
In this contribution, we first introduce the concept of metrical T-norm-based similarity measure for hesitant fuzzy sets (HFSs) {by using the concept of T-norm-based distance measure}. Then,the relationship of the proposed {metrical T-norm-based} similarity {measures} with the {other kind of information measure, called the metrical T-norm-based} entropy measure {is} discussed. The main feature ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Knowl.-Based Syst.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006